A Minimizing Movement: Fixed-Parameter Tractability
نویسندگان
چکیده
Erik D. Demaine, MIT Computer Science and Artificial Intelligence Laboratory, 32 Vassar St., Cambridge, MA 02139, USA, [email protected] 2 MohammadTaghi Hajiaghayi, A. V. Williams Building, University of Maryland, College Park, MD 20742, USA, [email protected]; and AT&T Labs — Research 3 Dániel Marx, Computer and Automation Research Institute, Hungarian Academy of Sciences (MTA SZTAKI), Budapest, Hungary, [email protected] 4
منابع مشابه
Bounded fixed-parameter tractability and reducibility
We study a refined framework of parameterized complexity theory where the parameter dependence of fixed-parameter tractable algorithms is not arbitrary, but restricted by a function in some familyF . For every family F of functions, this yields a notion of F -fixed parameter tractability. If F is the class of all polynomially bounded functions, then F -fixed parameter tractability coincides wit...
متن کاملFixed Parameter Tractability and Treewidth 14 . 1 Fixed Parameter Tractability
One of the ways to cope with hard problems in practice is to realized that problem instances may be associated with some “parameters” related to their complexity. If the parameter of an instance is small, we might have some hope in finding a polynomial time solution to that instance. This idea has been investigated in the 1990’s by Downian and Fellowes in their work on fixed parameter tractabil...
متن کاملParameterized complexity of team formation in social networks
Given a task that requires some skills and a social network of individuals with different skills, the Team Formation problem asks to find a team of individuals that together can perform the task, while minimizing communication costs. Since the problem is NP-hard, we identify the source of intractability by analyzing its parameterized complexity with respect to parameters such as the total numbe...
متن کاملOn the computational complexity of finding a minimal basis for the guess and determine attack
Guess-and-determine attack is one of the general attacks on stream ciphers. It is a common cryptanalysis tool for evaluating security of stream ciphers. The effectiveness of this attack is based on the number of unknown bits which will be guessed by the attacker to break the cryptosystem. In this work, we present a relation between the minimum numbers of the guessed bits and uniquely restricted...
متن کاملFixed-Parameter Tractability and Completeness III: Some Structural Aspects of the W Hierarchy
We analyse basic structural aspects of the reducibilities we use to describe fixed parameter tractability and intractability, in the model we introduced in earlier papers in this series. Results include separation and density, the latter for the strongest reducibility.
متن کامل